Task partitioning in new product development teams: A knowledge and learning perspective

R&D alliances and outsourcing elements of the new product development process are now commonplace practices among many firms. However, little previous work has examined how these organizational choices influence project knowledge and learning. Based on a comparison of three new product development projects in the software industry, this paper examines how task partitioning in the project influences learning and knowledge development within the firm. The paper suggests that internal development projects encourage synthetic learning and development of architectural and tacit knowledge; in contrast, outsourcing and joint ventures encourage analytic learning and development of component and explicit knowledge.     

公司企业家精神培育的系统理论假设模型及验证

企业家精神是企业永续发展的不竭动力。是21世纪推动一个国家经济发展最主要的动力之一。本文从微观角度出发,研究公司如何采取有效的措施促进公司企业家精神的培育,进而提高公司的经营业绩。笔者在国内外相关领域研究成果的基础上,提出了影响公司企业家精神培育的系统理论假设模型,并通过实证研究验证了假设模型。     

Chinese version of the OSI: A validation study

This article examines the construct validity of the Occupational Stress Indicator (OSI) in its Chinese version as well as its criterion-oriented validity against self-reported data on absenteeism and accidents, using a final sample of 1054 workers in the Chinese manufacturing and power industries. The divergent and convergent validities of five of the OSI scales—Job satisfaction, Physical ill-health, Mental ill-health, Type A behaviour and Control—were examined by a multimethod-multitrait matrix technique. Results indicated that the Chinese OSI had fairly good validity in relation to other well-established measures as well as relevant organizational behaviours.     

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions

Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned n_i numbers with n_i lying in a given range. The goal is to maximize a Schur convex function F whose ith argument is the sum of numbers assigned to part i. The shape of a partition is the vector consisting of the sizes of its parts, further, a shape (without referring to a particular partition) is a vector of nonnegative integers (n₁,..., n_p) which sum to n. A partition is called size-consecutive if there is a ranking of the parts which is consistent with their sizes, and all elements in a higher-ranked part exceed all elements in the lower-ranked part. We demonstrate that one can restrict attention to size-consecutive partitions with shapes that are nonmajorized, we study these shapes, bound their numbers and develop algorithms to enumerate them. Our study extends the analysis of a previous paper by Hwang and Rothblum which discussed the above problem assuming the existence of a majorizing shape. This research is partially supported by ROC National Science grant NSC 92-2115-M-009-014.     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.     

The web proxy location problem in general tree of rings networks

The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn ²) time complexity.This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).     

中国企业渠道联盟关系影响因素研究

渠道联盟被认为是渠道关系中最高、最好的形式。学术界对渠道联盟关系影响因素的研究主要集中在承诺、信任、沟通与合作等方面。本文实证研究了影响中国企业渠道联盟关系的若干因素及其影响程度,特别是探讨了私人关系和行政因素等的影响程度。     

基于反向物流的商品定价和退货政策研究

综述了基于反向物流的商品定价和退货政策的最新研究成果。在此基础上,通过建立模型,对基于反向物流的商品定价策略和退货政策进行了进一步的研究,并求出了商品的最优价格和最优退货价格。基于模型,对管理提出了一些建议。最后指出了将来可能的研究方向。     

市场时机对资本结构影响的持续度研究

市场股价信息会不断影响股权融资决策,对资本结构的影响甚至出现累积效应。为此,从中长期的角度探寻历史市场时机对公司资本结构形成和杠杆累计变动的影响,并具体测算出市场时机对资本结构影响的持续程度。研究表明,市场价格高的公司不仅在短时间内愿意进行股权融资,而且过去的市场价格信息也会对资本结构产生中长期的影响,在一定时间里不断累积。这种信息的影响大约会持续5年左右。     

我国上市公司盈余管理行为的实证分析

我国证券市场存在较为严重的盈余管理现象.针对该现象,本文从盈余管理动机出发,分析我国上市公司盈余管理的行为特征.本文采用管理后盈余分布法,研究了我国上市公司2001年至2003年净资产收益率(ROE)的分布特征,发现我国上市公司仍然存在很强的盈余管理动机,而且我国上市公司盈余管理的行为受到政府监管的影响.最后,本文在实证研究的基础上提出了治理盈余管理的几点建议.